Fast Domino Tileability
نویسندگان
چکیده
منابع مشابه
Fast Domino Tileability
Domino tileability is a classical problem in Discrete Geometry, famously solved by Thurston for simply connected regions in nearly linear time in the area. In this paper, we improve upon Thurston’s height function approach to a nearly linear time in the perimeter.
متن کاملRectangular tileability and complementary tileability are undecidable
Does a given a set of polyominoes tile some rectangle? We show that this problem is undecidable. In a different direction, we also consider tiling a cofinite subset of the plane. The tileability is undecidable for many variants of this problem. However, we present an algorithm for testing whether the complement of a finite region is tileable by a set of rectangles.
متن کاملFast and Scalable Domino Portrait Generation
A domino portrait is an approximation of an image using a given number of sets of dominoes. This problem was first stated in 1981. Domino portraits have been generated most often using integer linear programming techniques that provide optimal solutions, but these can be slow and do not scale well to larger portraits. In this paper we propose a new approach that overcomes these limitations and ...
متن کاملDomino portrait generation: a fast and scalable approach
A domino portrait is an approximation of an image using a given number of sets of dominoes. This problem was first formulated in 1981 by Ken Knowlton in a patent application, which was finally granted in 1983. Domino portraits have been generated most often using integer linear programming techniques that provide optimal solutions, but these can be slow and do not scale well to larger portraits...
متن کاملOn the Tileability of Polygons with Colored Dominoes
We consider questions concerning the tileability of orthogonal polygons with colored dominoes. A colored domino is a rotatable 2× 1 rectangle that is partitioned into two unit squares, which are called faces, each of which is assigned a color. In a colored domino tiling of an orthogonal polygon P , a set of dominoes completely covers P such that no dominoes overlap and so that adjacent faces ha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2016
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-016-9807-1